User Fair Queing: Fair Allocation of Bandwidth for Users

نویسنده

  • Albert Banchs
چکیده

User Fairness aims at fairly distributing the network resources among users, where a user is an entity that can possibly send different flows through different paths. In this paper we first propose a criterion for user fairness based on political economics fairness theory: the User Maxmin Fairness criterion. Then we propose an architecture, User Fair Queuing (UFQ), that provides user maxmin fairness without keeping per-user state in the core nodes. UFQ requires neither admission control nor signaling. We present simulations and analysis on the performance of the proposed architecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fair Power Allocation for Non-Orthogonal Multiple Access in the Power Domain

This paper presents an investigation on the performance of the Non-Orthogonal Multiple Access (NOMA) in the power domain scheme. A Power Allocation (PA) method is proposed from NOMA throughput expression analysis. This method aims to provide fair opportunities for users to improve their performance. Thus, NOMA users can achieve rates higher than, or equal to, the rates obtained with the convent...

متن کامل

A game-theoretic model for capacity-constrained fair bandwidth allocation

Data stream providers face a hard decision to satisfy the requirements of their subscribers. Each user has a minimum and a maximum required bandwidth. The server should be able to decide which requests can be satisfi ed and how much bandwidth will be allocated to each. We present a theoretical framework in a distributed mechanism for fair bandwidth allocation on a network with various bottlenec...

متن کامل

Fair Scheduling in Internet Routers

ÐInput buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling(i FS) scheme for input buffered switc...

متن کامل

ATBAS: an efficient fair bandwidth allocation approach for multihop wireless ad hoc network

The application of multihop Wireless Ad Hoc Networks (WANETs) has been facing a great challenge to implement cooperative control over user transmission rates under the resource restrictions. In this paper, we propose an efficient bandwidth allocation scheme called Active-Time-Based Bandwidth Allocation Scheme (ATBAS) that can ensure fair bandwidth allocation among the users in a multihop WANET ...

متن کامل

Distributed Fair Bandwidth Allocation of a Wireless Base Station

We present a novel approach to wireless fair scheduling in a distributed architecture. Our scheme is based on a simple extension of wireline fair scheduling by compensation for lost capacity after the losses occur. In addition, the scheduler can give limited compensation for unused capacity. This provides an incentive for users of the location-dependent wireless channel to optimize their channe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002